Semidefinite programming via image space analysis
نویسندگان
چکیده
منابع مشابه
Structural Design via Semidefinite Programming
We consider a general problem of Structural Design and demonstrate that under mild assumptions it can be posed as a Semidefinite program. The approach in question allows for unified treatment of single-load/multi-load Truss and Shape design with and without obstacles, same as for obstacle-free robust Truss and Shape design. We present three equivalent Semidefinite formulations of the Structural...
متن کاملProduct Theorems Via Semidefinite Programming
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lovász to determine the Shannon capacity of the pentagon; to show a direct sum theorem for non-deterministic communication complexity and direct product theorems for discrepancy; and in interactive proof systems to show parallel repetition theorems for res...
متن کاملSemidefinite Programming in the Space of Partial Positive Semidefinite Matrices
We build upon the work of Fukuda et al. [SIAM J. Optim., 11 (2001), pp. 647–674] and Nakata et al. [Math. Program., 95 (2003), pp. 303–327], in which the theory of partial positive semidefinite matrices was applied to the semidefinite programming (SDP) problem as a technique for exploiting sparsity in the data. In contrast to their work, which improved an existing algorithm based on a standard ...
متن کاملGlobal Sensitivity Analysis of Biochemical Reaction Networks Via Semidefinite Programming
We study the problem of computing outer bounds for the region of steady states of biochemical reaction networks modelled by ordinary differential equations, with respect to parameters that are allowed to vary within a predefined region. Using a relaxed version of the corresponding feasibility problem and its Lagrangian dual, we show how to compute certificates for regions in state space not con...
متن کاملHierarchical Image Segmentation Based on Semidefinite Programming
Image segmentation based on graph representations has been a very active field of research recently. One major reason is that pairwise similarities (encoded by a graph) are also applicable in general situations where prototypical image descriptors as partitioning cues are no longer adequate. In this context, we recently proposed a novel convex programming approach for segmentation in terms of o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial and Management Optimization
سال: 2016
ISSN: 1547-5816
DOI: 10.3934/jimo.2016.12.1187